Zero Forcing in Claw-Free Cubic Graphs
نویسندگان
چکیده
منابع مشابه
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polynomial coefficients whose power series solution is the exponential generating function for {Hn}. This leads to a recurrence relation for Hn which shows {Hn} to be P -recursive and which enables the sequence to be comput...
متن کاملPerfect Matchings in Claw-free Cubic Graphs
Lovász and Plummer conjectured that there exist a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2cn perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve and planar graphs by Chudnovsky and Seymour. We prove that every claw-free cubic n-vertex graph with no cutedge has more than
متن کاملBounds on total domination in claw-free cubic graphs
A set S of vertices in a graphG is a total dominating set, denoted by TDS, ofG if every vertex ofG is adjacent to some vertex in S (other than itself). The minimum cardinality of a TDS ofG is the total domination number ofG, denoted by t(G). IfG does not contain K1,3 as an induced subgraph, then G is said to be claw-free. It is shown in [D. Archdeacon, J. Ellis-Monaghan, D. Fischer, D. Froncek,...
متن کاملThe asymptotic number of claw-free cubic graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. In an earlier paper we characterized claw-free cubic graphs and derived a recurrence relation for Hn. Here
متن کاملClaw-free Graphs VI. Colouring Claw-free Graphs
In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic number χ and clique number ω, then χ ≤ 2ω and the same for the complement of G. We also prove that the choice number of G is at most 2ω, except possibly in the case when G can be obtained from a subgraph of the Schläfli graph by replicating vertices. Finally, we show that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society
سال: 2018
ISSN: 0126-6705,2180-4206
DOI: 10.1007/s40840-018-00705-5